Finding Exception for Association Rules via Sql Queries
نویسنده
چکیده
Finding association rules is mainly based on generating larger and larger frequent set candidates, starting from frequent attributes in the database. The frequent sets can be organised as a part of a lattice of concepts according to the Formal Concept Analysis approach. Since the lattice construction is database contents-dependent, the pseudo-intents (see Formal Concept Analysis) are avoided. Association rules between concept intents (closed sets) A=>B are partial implication rules, meaning that there is some data supporting A and (not B); fully explaining the data requires finding exceptions for the association rules. The approach applies to Oracle databases, via SQL queries.
منابع مشابه
Mining Association Rules of Simple Conjunctive Queries
We present an algorithm for mining association rules in arbitrary relational databases. We define association rules over a simple, but appealing subclass of conjunctive queries, and show that many interesting patterns can be found. We propose an efficient algorithm and a database-oriented implementation in SQL, together with several promising and convincing experimental results.
متن کاملAdding Knowledge Extracted by Association Rules into Similarity Queries
In this paper, we propose new techniques to improve the quality of similarity queries over image databases performing association rule mining over textual descriptions and automatically extracted features of the image content. Based on the knowledge mined, each query posed is rewritten in order to better meet the user expectations. We propose an extension of SQL aimed at exploring mining proces...
متن کاملQuerying Temporal Databases via OWL 2 QL
SQL:2011, the most recently adopted version of the SQL query language, has unprecedentedly standardized the representation of temporal data in relational databases. Following the successful paradigm of ontology-based data access, we develop a practical approach to querying the SQL:2011-based temporal data model via the semantic layer of OWL 2 QL. The interval-based temporal query language (TQL)...
متن کاملExecuting Nested Queries
Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensively. In contrast, with the exception of nested loops join, execution of nested plans has found little interest. Nested execution plans may result from a failure to flatten nested SQL expressions but just as likely are created by a ...
متن کاملMining Generalized Association Rules and Sequential Patterns Using SQL Queries
Database integration of mining is becoming increasingly important with tile installation of larger and larger data warehouses built around relational database technology. Most of the commercially available mining systems integrate loosely (typically, through an ODBC or SQL cursor interface) with data stored in DBMSs. In cases where the mining algorithm makes nmltiple passes over the data, it is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001